Exact and approximate continuous-variable gate decompositions

existence and approximate $l^{p}$ and continuous solution of nonlinear integral equations of the hammerstein and volterra types

بسیاری از پدیده ها در جهان ما اساساً غیرخطی هستند، و توسط معادلات غیرخطی ‎‏بیان شد‎‎‏ه اند. از آنجا که ظهور کامپیوترهای رقمی با عملکرد بالا، حل مسایل خطی را آسان تر می کند. با این حال، به طور کلی به دست آوردن جوابهای دقیق از مسایل غیرخطی دشوار است. روش عددی، به طور کلی محاسبه پیچیده مسایل غیرخطی را اداره می کند. با این حال، دادن نقاط به یک منحنی و به دست آوردن منحنی کامل که اغلب پرهزینه و ...

Indexing Variable Length Substrings for Exact and Approximate Matching

We introduce two new index structures based on the q-gram index. The new structures index substrings of variable length instead of q-grams of fixed length. For both of the new indexes, we present a method based on the suffix tree to efficiently choose the indexed substrings so that each of them occurs almost equally frequently in the text. Our experiments show that the resulting indexes are up ...

Approximate Inverses and Incomplete Decompositions

In this work we consider the approximate inverse preconditioners AISM based on the Sherman-Morrison formula [1]. We will show some of theoretical properties of the factors of AISM in function of the value of parameter s considered in the decomposition. In particular, we will show that one of the factors hides a scaled factor of the standard incomplete LDU decomposition of the system matrix A. T...

Gate sequence for continuous variable one-way quantum computation

Measurement-based one-way quantum computation using cluster states as resources provides an efficient model to perform computation and information processing of quantum codes. Arbitrary Gaussian quantum computation can be implemented sufficiently by long single-mode and two-mode gate sequences. However, continuous variable gate sequences have not been realized so far due to an absence of cluste...

Exact and approximate . . .